A taxonomy of sublinear multiple keyword pattern matching algorithms
نویسندگان
چکیده
منابع مشابه
A Taxonomy of Sublinear Multiple Keyword Pattern Matching Algorithms
This paper presents a taxonomy of sublinear keyword pattern matching algorithms related to the Boyer-Moore algorithm [BM77) and the Commentz-Walter algorithm [CW79a, CW79b). The taxonomy includes, amongst others, the multiple keyword generalization of the single keyword Boyer-Moore algorithm and an algorithm by Fan and Su [FS93, FS94). The corresponding precomputatioD algorithms are pre~ented a...
متن کاملA new taxonomy of sublinear keyword pattern matching algorithms
This paper presents a new taxonomy of sublinear (multiple) keyword pattern matching algorithms. Based on an earlier taxonomy by Watson and Zwaan [WZ96, WZ95], this new taxonomy includes not only suffix-based algorithms related to the Boyer-Moore, CommentzWalter and Fan-Su algorithms, but factorand factor oracle-based algorithms such as Backward DAWG Matching and Backward Oracle Matching as well...
متن کاملMultiple Keyword Pattern Matching using Position Encoded Pattern Lattices
Formal concept analysis is used as the basis for two new multiple keyword string pattern matching algorithms. The algorithms addressed are built upon a so-called position encoded pattern lattice (PEPL). The algorithms presented are in conceptual form only; no experimental results are given. The first algorithm to be presented is easily understood and relies directly on the PEPL for matching. It...
متن کاملSingle-Keyword Pattern Matching Algorithms for Network Intrusion Detection System
The Network Intrusion Detection System (NIDS) is an important part of any modern network. One of the important processes in NIDS is inspecting of individuals’ packets in network traffic, deciding if these packets are infected with any malicious activities. This process, which is called content matching, is done via string matching algorithms. The content matching is considered the heart of NIDS...
متن کاملMultiple Pattern Matching Algorithms on Collage System
Compressed pattern matching is one of the most active topics in string matching. The goal is to find all occurrences of a pattern in a compressed text without decompression. Various algorithms have been proposed depending on underlying compression methods in the last decade. Although some algorithms for multipattern searching on compressed text were also presented very recently, all of them are...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 1996
ISSN: 0167-6423
DOI: 10.1016/0167-6423(96)00008-1